Orientations of Simplices Determined by Orderings on the Coordinates of their Vertices

نویسندگان

  • Emeric Gioan
  • Kevin Sol
  • Gérard Subsol
چکیده

Provided n points in an (n − 1)-dimensional affine space, and one ordering of the points for each coordinate, we address the problem of testing whether these orderings determine if the points are the vertices of a simplex (i.e. are affinely independent), regardless of the real values of the coordinates. We also attempt to determine the orientation of this simplex. In other words, given a matrix whose columns correspond to affine points, we want to know when the sign (or the non-nullity) of its determinant is implied by orderings given to each row for the values of the row. We completely solve the problem in dimensions 2 and 3. We provide a direct combinatorial characterization, along with a formal calculus method. It can also be viewed as a decision algorithm, and is based on testing the existence of a suitable inductive cofactor expansion of the determinant. We conjecture that our method generalizes in higher dimensions. This work aims to be part of a study on how oriented matroids encode shapes of 3-dimensional landmark-based objects. Specifically, applications include the analysis of anatomical data for physical anthropology and clinical research.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hessian Stochastic Ordering in the Family of multivariate Generalized Hyperbolic Distributions and its Applications

In this paper, random vectors following the multivariate generalized hyperbolic (GH) distribution are compared using the hessian stochastic order. This family includes the classes of symmetric and asymmetric distributions by which different behaviors of kurtosis in skewed and heavy tail data can be captured. By considering some closed convex cones and their duals, we derive some necessary and s...

متن کامل

On the Geometry of Simplices in Minkowski Spaces

Let T be a d-dimensional simplex in a d-dimensional real normed space (= Minkowski space). We introduce a special Minkowskian area-measure and Minkowskian trilinear coordinates with respect to T, allowing us to study Minkowskian balls which are tangent to all hyperplanes determined by the facets of T. Finally we apply the derived statements to characterize simplices having special Minkowskian p...

متن کامل

Riemannian Simplices and Triangulations

We study a natural intrinsic definition of geometric simplices in Riemannian manifolds of arbitrary finite dimension, and exploit these simplices to obtain criteria for triangulating compact Riemannian manifolds. These geometric simplices are defined using Karcher means. Given a finite set of vertices in a convex set on the manifold, the point that minimises the weighted sum of squared distance...

متن کامل

Subdivisions of Transitive Tournaments

We prove that, for r ≥ 2 and n ≥ n(r), every directed graph with n vertices and more edges than the r-partite Turán graph T (r, n) contains a subdivision of the transitive tournament on r + 1 vertices. Furthermore, the extremal graphs are the orientations of T (r, n) induced by orderings of the vertex classes.

متن کامل

Discretizing Wachspress kernels is safe

Barycentric coordinates were introduced by Möbius in 1827 as an alternative to Cartesian coordinates. They describe points relative to the vertices of a simplex and are commonly used to express the linear interpolant of data given at these vertices. Generalized barycentric coordinates and kernels extend this idea from simplices to polyhedra and smooth domains. In this paper, we focus on Wachspr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1602.01641  شماره 

صفحات  -

تاریخ انتشار 2011